Resolvable modified group divisible designs with higher index
نویسندگان
چکیده
A resolvable modified group divisible design (RMGD) is a modified group divisible design whose blocks can be partitioned into parallel classes. We show that the necessary conditions for the existence of a 3-RMGDDλ of type g, namely g ≥ 3, u ≥ 3, gu ≡ 0 mod 3 and λ(g−1)(u−1) ≡ 0 mod 2, are sufficient with the two exceptions of (g, u, λ) ∈ {(6, 3, 1), (3, 6, 1)}.
منابع مشابه
Class-Uniformly Resolvable Group Divisible Structures I: Resolvable Group Divisible Designs
We consider Class-Uniformly Resolvable Group Divisible Designs (CURGDD), which are resolvable group divisible designs in which each of the resolution classes has the same number of blocks of each size. We derive the fully general necessary conditions including a number of extremal bounds. We present some general constructions including a novel construction for shrinking the index of a master de...
متن کاملResolvable Modified Group Divisible Designs with Block Size Three
A resolvable modified group divisible design (RMGDD) is an MGDD whose blocks can be partitioned into parallel classes. In this article, we investigate the existence of RMGDDs with block size three and show that the necessary conditions are also sufficient with two exceptions. # 2005 Wiley Periodicals, Inc. J Combin Designs 15: 2–14, 2007
متن کاملResolvable group divisible designs with block size 3
A group divisible design is resolvable if there exists a partition n = {P,, Pz, . .} of p such that each part Pi is itself a partition of X. In this paper we investigate the existence of resolvable group divisible designs with K = {3}, M a singleton set, and all A. The case where M = { 1) has been solved by Ray-Chaudhuri and Wilson for I = 1, and by Hanani for all h > 1. The case where M is a s...
متن کاملLinked system of symmetric group divisible designs of type II
The linked systems of symmetric group divisible designs of type II is introduced, and several examples are obtained from affine resolvable designs and mutually UFS Latin squares. Furthermore, an equivalence between such symmetric group divisible designs and some association schemes with 5-classes is provided.
متن کاملResolvable Group Divisible Designs with Large Groups
We prove that the necessary divisibility conditions are sufficient for the existence of resolvable group divisible designs with a fixed number of sufficiently large groups. Our method combines an application of the Rees product construction with a streamlined recursion based on incomplete transversal designs. With similar techniques, we also obtain new results on decompositions of complete mult...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 41 شماره
صفحات -
تاریخ انتشار 2008